Greedy approximations for minimum submodular cover with submodular cost
نویسندگان
چکیده
It is well-known that a greedy approximation with an integer-valued polymatroid potential function f is H(γ )-approximation of the minimum submodular cover problem with linear cost where γ is the maximum value of f over all singletons and H(γ ) is the γ -th harmonic number. In this paper, we establish similar results for the minimum submodular cover problem with a submodular cost (possibly nonlinear) and/or fractional submodular potential function f .
منابع مشابه
Approximation Algorithms for Submodular Set Cover with Applications
The main problem considered is submodular set cover, the problem of minimizing a linear function under a nondecreasing submodular constraint, which generalizes both wellknown set cover and minimum matroid base problems. The problem is NP-hard, and two natural greedy heuristics are introduced along with analysis of their performance. As applications of these heuristics we consider various specia...
متن کاملApproximating Minimum Linear Ordering Problems
This paper addresses the Minimum Linear Ordering Problem (MLOP): Given a nonnegative set function f on a finite set V , find a linear ordering on V such that the sum of the function values for all the suffixes is minimized. This problem generalizes well-known problems such as the Minimum Linear Arrangement, Min Sum Set Cover, Minimum Latency Set Cover, and Multiple Intents Ranking. Extending a ...
متن کاملMinimum Entropy Submodular Optimization (and Fairness in Cooperative Games)
We study minimum entropy submodular optimization, a common generalization of the minimum entropy set cover problem, studied earlier by Cardinal et al., and the submodular set cover problem (Wolsey [Wol82], Fujishige [BIKP01], etc). We give a general bound of the approximation performance of the greedy algorithm using an approach that can be interpreted in terms of a particular type of biased ne...
متن کاملThe Minimum Entropy Submodular Set Cover Problem
We study minimum entropy submodular set cover, a variant of the submodular set cover problem (Wolsey [22], Fujito [11], etc) that generalizes the minimum entropy set cover problem (Halperin and Karp [12], Cardinal et al. [5]) We give a general bound of the approximation performance of the greedy algorithm using an approach that can be interpreted in terms of a particular type of biased network ...
متن کاملGeneralized Submodular Cover Problems and Applications
The greedy approach has been successfully applied in the past to produce logarithmic ratio approximations to NP-hard problems under certain conditions. The problems for which these conditions hold are known as submodular cover problems. The current paper 1 extends the applicability of the greedy approach to wider classes of problems. The usefulness of our extensions is illustrated by giving new...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comp. Opt. and Appl.
دوره 45 شماره
صفحات -
تاریخ انتشار 2010